A Generalized Fundamental Matrix for Computing Fundamental Quantities of Markov Systems

نویسندگان

  • Li Xia
  • Peter W. Glynn
چکیده

As is well known, the fundamental matrix (I − P + eπ) plays an important role in the performance analysis of Markov systems, where P is the transition probability matrix, e is the column vector of ones, and π is the row vector of the steady state distribution. It is used to compute the performance potential (relative value function) of Markov decision processes under the average criterion, such as g = (I −P + eπ)f where g is the column vector of performance potentials and f is the column vector of reward functions. However, we need to pre-compute π before we can compute (I − P + eπ). In this paper, we derive a generalization version of the fundamental matrix as (I − P + er), where r can be any given row vector satisfying re 6= 0. With this generalized fundamental matrix, we can compute g = (I−P +er)f . The steady state distribution is computed as π = r(I−P+er). The Q-factors at every state-action pair can also be computed in a similar way. These formulas may give some insights on further understanding how to efficiently compute or estimate the values of g, π, and Q-factors in Markov systems, which are fundamental quantities for the performance optimization of Markov systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Use of Fundamental Color Stimulus to Improve the Performance of Artificial Neural Network Color Match Prediction Systems

In the present investigation attempts were made for the first time to use the fundamental color stimulus as the input for a fixed optimized neural network match prediction system. Four sets of data having different origins (i.e. different substrate, different colorant sets and different dyeing procedures) were used to train and test the performance of the network. The results showed that th...

متن کامل

Fundamental Solutions of Dynamic Poroelasticity and Generalized Termoelasticity

Fundamental solutions of dynamic poroelasticity and generalized thermoelasticity are derived in the Laplace transform domain. For poroelasticity, these solutions define the solid displacement field and the fluid pressure in fluid-saturated media due to a point force in the solid and an injection of fluid in the pores. In addition, approximate fundamental solutions for short times are derived by...

متن کامل

Overcoming Instability in Computing the Fundamental Matrix for a Markov Chain∗

We present an algorithm for solving linear systems involving the probability or rate matrix for a Markov chain. It is based on a UL factorization but works only with a submatrix of the factor U. We demonstrate its utility on Erlang-B models as well as more complicated models of a telephone multiplexing system.

متن کامل

Generalized Laplacians and First Transit Times for Directed Graphs

In this paper, we extend previous results on average commute-times for undirected graphs to fully-connected directed graphs, corresponding to irreducible Markov chains. We introduce an unsymmetrized generalized Laplacian matrix and show how its pseudo-inverse directly yields the one-way first-transit times and round-trip commute times with formulas almost matching those for the undirected graph...

متن کامل

Algorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity

We address the batch arrival  systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1604.04343  شماره 

صفحات  -

تاریخ انتشار 2016